A chaos search for implementing optimal multi - user detection in cdma system has been proposed . computer simulation illustrated that this way has many powerful abilities . its capability is better than the traditional detection and the multi - series detection , it is near to the omd which was presented by verdu , and then its beginning condition is insensitivity , near - far insensitivity , eliminate interference , it can converge to global minimum point and hold down the noise interference 通过仿真证明：其性能优于传统检测器( cd ) 、多级多用户检测器( msd )而接近于文献[ 1 ]中提出的最佳多用户检测器( omd ) ，具有对初始条件不敏感、对“远近”问题不敏感和优良的抗干扰性能，并提高了通信系统的系统容量，能寻优到全局极小点，以及能抑制噪声干扰，而且，计算复杂度较低。
Computational simulation in nano size metal cluster in chapter 2 , we use dft to calculate equilibrium geometries and electronic properties of cun ( n = 2 - 13 ) clusters and construct potential function with parameters fitted to potential energy surfaces , use a global minima " basin - hopping " algorithm to obtain minimum - energy structures of cu clusters for n = 13 ~ 410 . the results show in good agreement with experiments and other calculations 纳米金属团簇的计算模拟利用密度泛函方法对小cu簇( n = 2 13 )进行计算并构造了铜原子簇原子间相互作用多体势，用全局优化模拟了中等和大的铜团簇的结构与稳定性，结果证实了铜团簇具有五次对称性和幻数现象。
Improving methods are introduced about how to solve the problem of initial value and global minimum , how to find the closest contour point , and how to find the 2d transformation of terrain matching algorithm based on icp algorithm in the dissertation . icp algorithm by igg m - estimation is proposed for improving the robustness . the simulation results show that the algorithm is reasonable and effective 本文对icp算法在水下潜器的地形匹配应用中的初值和全局最优、求最近点和进行二维变换等问题提出了改进的方法，而且提出了采用igg方案进行m估计以提高算法的鲁棒性，仿真结果证实此方案的合理性和有效性。
In order to apply these models to solve optimization problems , we design a parameter to control the networks dynamics . as the parameter is gradually reduced , a reverse bifurcation process results . the process starts with an unstable phase for searching global minima , followed by a stable , convergent phase 为了利用这个机制，我们设计了一个控制参数，使得网络首先对状态空间作暂时的搜索，然后由这个参数控制混沌动态逐渐消失并转入类似于hopfield网络的梯度搜索，最终获得系统的全局最优解。
7 . for the purpose of analyzing its asymptotic convergence properties the evolution strategy procedures for real - valued function optimization are described . two convergence theorems , which show that under suitable conditions the evolution strategy asymptotically converges to a global minimum point with probability one , are given 对于有界闭集上的连续函数，利用作者给出的一种简洁的方法，证明了一类进化策略以概率为1收敛（几乎处处收敛）于优化问题的全局极小点，为进化算法的收敛性分析提供了一种新的模式。
Many fast block - based motion estimation algorithms have been proposed to reduce the computational complexity , for examples , three - step search , four - step search , new three - step search , etc . most of the fast block matching algorithms are based on the assumption that the block distortion measure increases monotonically as the check point moves away from the global minimum block distortion measure point 这些快速搜索算法大多基于块失真度量随着搜索点偏离最佳匹配点而单调增加的假定,但是这种假定往往只在局部范围成立,对于块失真度量是多极值分布的情况,搜索过程就可能陷入局部最优。
